منابع مشابه
Determining Consecutive Periods of the Lorenz Maps
Based on symbolic dynamics, the paper provides a satisfactory and necessary condition of existence for consecutive periodic orbits of the Lorenz maps. In addition, a new algorithm with computer assistance based on symbolic dynamics is proposed to find all periodic orbits up to a certain number with little computer time. Examples for consecutive periods of orbits are raised for the Lorenz maps. ...
متن کاملThree-Dimensional HÉnon-like Maps and Wild Lorenz-like attractors
We discuss a rather new phenomenon in chaotic dynamics connected with the fact that some three-dimensional diffeomorphisms can possess wild Lorenz-type strange attractors. These attractors persist for open domains in the parameter space. In particular, we report on the existence of such domains for a three-dimensional Hénon map (a simple quadratic map with a constant Jacobian which occurs in a ...
متن کاملTsallis Maximum Entropy Lorenz Curves
In this paper, at first we derive a family of maximum Tsallis entropy distributions under optional side conditions on the mean income and the Gini index. Furthermore, corresponding with these distributions a family of Lorenz curves compatible with the optional side conditions is generated. Meanwhile, we show that our results reduce to Shannon entropy as $beta$ tends to one. Finally, by using ac...
متن کاملEntropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملentropy estimate for maps on forests
a 1993 result of j. llibre, and m. misiurewicz, (theorem a [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. also a 1980 result of l.s. block, j. guckenheimer, m. misiurewicz and l.s. young (lemma 1.5 [3]) states that if g is an a-graph of f then h(g) ? h( f ). in this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 1989
ISSN: 0373-0956
DOI: 10.5802/aif.1195